A Procedural Semantics for Multi-adjoint Logic Programming
نویسندگان
چکیده
Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and completeness theorems are proved.
منابع مشابه
A Completeness Theorem for Multi-Adjoint Logic Programming
Multi-adjoint logic programs generalise monotonic and residuated logic programs [2] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and a completeness result is proved. Some ap...
متن کاملBiresiduated Multi-Adjoint Logic Programming
Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...
متن کاملNon-commutativity and Expressive Deductive Logic Databases
The procedural semantics of multi-adjoint logic programming is used for providing a model-theoretic semantics for a data model. A translation method for deductive logic databases is presented for obtaining a relational algebra with classical projection and enriched parametric join operator with aggregations. The use of non-commutative conjunctors allows for a model of different degrees of granu...
متن کاملSimilarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming which allows the simultaneous use of different implications in the rules and rather general connectives in the bodies is introduced, then a procedural semantics for this framework is presented, and an aproximative-complet...
متن کاملMulti-Adjoint Logic Programming
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range from a proof theory together with some (quasi)completeness results to general termination results, and from the neural-like implementation of its fix-point semantics to the more general biresiduated multi-adjoint logic programming and its relationship with other approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001